An optimum symbol-by-symbol decoding rule for linear codes
نویسندگان
چکیده
منابع مشابه
An optimum symbol-by-symbol decoding rule for linear codes
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.
متن کاملSymbol-by-Symbol MAP Decoding of Variable Length Codes
In this paper we introduce a new approach in the decoding of variable length codes. Based on the tree structure of these codes a trellis representation is derived which allows the application of the BCJR algorithm. This algorithm provides us with the a posteriori probabilities of the transmitted source symbols. Therefore we do not only use soft information from an outer decoding stage but also ...
متن کاملSymbol-by-Symbol MAP Decoding of Nonbinary Codes
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convolutional codes over both extension elds GF(q = p a) and integer rings Z q are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more eecient for high-rate codes. The suitabil-ity of the proposed algorithms is demonstrated by applying them to a pa...
متن کاملOptimal Decoding of Linear Codes for Minimizing Symbol
The previous are identical to the expressions (2) and (3). Thus the n 1 columns do consist of two repetitions of 2”-r-level Gray code. Now if we combine the first two columns again, we reduce each 2”-‘-level Gray code into two 2n-2-level Gray codes, or, the complete array into four 2”-2-level Gray codes. This can continue until we have only m columns, which would be 2n-m repetitions of 2”‘-leve...
متن کاملSymbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes
An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1976
ISSN: 0018-9448
DOI: 10.1109/tit.1976.1055617